Improved Upper Bounds on Stopping Redundancy
نویسندگان
چکیده
منابع مشابه
Improved upper bounds on sizes of codes
Let ( ) denote the maximum possible number of codewords in a binary code of length and minimum Hamming distance . For large values of , the best known upper bound, for fixed , is the Johnson bound. We give a new upper bound which is at least as good as the Johnson bound for all values of and , and for each there are infinitely many values of for which the new bound is better than the Johnson bo...
متن کاملImproved Redundancy Bounds for Exponential Objectives
We present new lower and upper bounds for the compression rate of binary prefix codes optimized over memoryless sources according to two related exponential codeword length objectives. The objectives explored here are exponential-average length and exponential-average redundancy. The first of these relates to various problems involving queueing, uncertainty, and lossless communications, and it ...
متن کاملBounds on separating redundancy
It is known that any linear code allows for a decoding strategy that treats errors and erasures separately over an error-erasure channel. In particular, a carefully designed paritycheck matrix makes efficient erasure correction possible through iterative decoding while instantly providing the necessary paritycheck equations for independent error correction on demand. The separating redundancy o...
متن کاملImproved upper bounds for partial spreads
A partial (k−1)-spread in PG(n−1, q) is a collection of (k−1)-dimensional subspaces with trivial intersection such that each point is covered exactly once. So far the maximum size of a partial (k − 1)-spread in PG(n− 1, q) was know for the cases n ≡ 0 (mod k), n ≡ 1 (mod k) and n ≡ 2 (mod k) with the additional requirements q = 2 and k = 3. We completely resolve the case n ≡ 2 (mod k) for the b...
متن کاملImproved Parameterized Upper Bounds for Vertex Cover
This paper presents an O(1.2738 + kn)-time polynomialspace parameterized algorithm for Vertex Cover improving the previous O(1.286+kn)-time polynomial-space upper bound by Chen, Kanj, and Jia. The algorithm also improves the O(1.2745k+kn)-time exponentialspace upper bound for the problem by Chandran and Grandoni.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2007
ISSN: 0018-9448
DOI: 10.1109/tit.2006.887513